Non-Linearity and Security of Self Synchronizing Stream Ciphers

نویسندگان

  • Philippe Guillot
  • Sihem Mesnager
چکیده

Several proposed chaos based ciphers exploit the ergodic property of chaotic orbits. As chaotic systems are unstable and have sensitive dependence on initial conditions, the main difficulty for the receiver is to reproduce the chaotic signal that has been generated by the sender in order to correctly decrypt the message. This is performed by a self synchronizing device. In discrete cryptography, the closest scheme is the so called self synchronizing stream cipher (SSSC). After recalling general security models for assessing cryptographic algorithms, we present SSSC scheme and two examples of cryptanalysis. In order to resist to theses attacks, the ciphering function must satisfy high non-linearity properties which are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-Synchronizing Stream Ciphers and Dynamical Systems: State of the Art and Open Issues

synchronizing stream ciphers and dynamical systems: state of the art and open issues. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplina...

متن کامل

Stream ciphers and the eSTREAM project

Stream ciphers are an important class of symmetric cryptographic algorithms. The eSTREAM project contributed significantly to the recent increase of activity in this field. In this paper, we present a survey of the eSTREAM project. We also review recent time/memory/data and time/memory/key trade-offs relevant for the generic attacks on stream ciphers.

متن کامل

New Directions in Cryptanalysis of Self-Synchronizing Stream Ciphers

In cryptology we commonly face the problem of finding an unknown key K from the output of an easily computable keyed function F (C,K) where the attacker has the power to choose the public variable C. In this work we focus on self-synchronizing stream ciphers. First we show how to model these primitives in the above-mentioned general problem by relating appropriate functions F to the underlying ...

متن کامل

Chosen Ciphertext Attack on a New Class of Self-Synchronizing Stream Ciphers

At Indocrypt’2002, Arnault et al. proposed a new class of self-synchronizing stream ciphers combining LFSR and FCSR architectures. It was claimed to be resistant to known attacks. In this paper, we show that such a self-synchronizing stream cipher is extremely vulnerable to chosen ciphertext attack. We can restore the secret keys easily from one chosen ciphertext with little computation. For th...

متن کامل

Security proof of the canonical form of self-synchronizing stream ciphers

This paper studies the security level expected by the canonical form of the Self-Synchronizing Stream Cipher (SSSC). A SSSC can be viewed as the combination of a shift register together with a filtering function. The maximum security of such a cipher is reached when the filtering function is random. However, in practice, Pseudo Random Functions (PRF) are used as filtering functions. In this cas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005